Ranking nodes in growing networks: When PageRank fails – Supplementary Information
نویسندگان
چکیده
S1 Temporal decay of the average relevance r(t) and activity a(t) in Digg.com social network 5 S2 Temporal decay of the average relevance r(t) in the APS dataset . . . . . . . . . . . . 5 S3 Age distribution of the top 1% nodes in the ranking (APS data and the corresponding calibrated simulation) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 S4 Outdegree distribution in the APS dataset . . . . . . . . . . . . . . . . . . . . . . . . . 6 S5 Linking pattern in the extended fitness model (EFM) . . . . . . . . . . . . . . . . . . . 7 S6 Average birth time τ of the top 1% of nodes as ranked by PageRank . . . . . . . . . . 8 S7 Indegree-PageRank correlation in the RM and EFM . . . . . . . . . . . . . . . . . . . 8 S8 Fitness-PageRank correlation in the RM and EFM . . . . . . . . . . . . . . . . . . . . 9 S9 Comparison between PageRank and indegree in the RM with uniform fitness distribution 9 S10 Comparison between PageRank and indegree in the RM and EFM with power-law aging 10 S11 Comparison between PageRank and indegree in the RM and EFM using precision . . 11 S12 Comparison between PageRank and indegree in the RM with accelerated growth . . . 11 S13 Comparison of total relevance with indegree (left) and PageRank (right) in the RM . . 12 S14 Comparison of total relevance with indegree (left) and PageRank (right) in the EFM . 12
منابع مشابه
Ranking nodes in growing networks: When PageRank fails
PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm's efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank's p...
متن کاملTowards Supporting Exploratory Search over the Arabic Web Content: The Case of ArabXplore
Due to the huge amount of data published on the Web, the Web search process has become more difficult, and it is sometimes hard to get the expected results, especially when the users are less certain about their information needs. Several efforts have been proposed to support exploratory search on the web by using query expansion, faceted search, or supplementary information extracted from exte...
متن کاملPath diversity improves the identification of influential spreaders
Identifying influential spreaders in complex networks is a crucial problem which relates to wide applications. Many methods based on the global information such as k-shell and PageRank have been applied to rank spreaders. However, most of related previous works overwhelmingly focus on the number of paths for propagation, while whether the paths are diverse enough is usually overlooked. Generall...
متن کاملTowards two-dimensional search engines
We study the statistical properties of various directed networks using ranking of their nodes based on the dominant vectors of the Google matrix known as PageRank and CheiRank. On average PageRank orders nodes proportionally to a number of ingoing links, while CheiRank orders nodes proportionally to a number of outgoing links. In this way the ranking of nodes becomes two-dimensional that paves ...
متن کاملRanking Users in Social Networks with Higher-Order Structures
PageRank has been widely used to measure the authority or the influence of a user in social networks. However, conventional PageRank only makes use of edge-based relations, ignoring higher-order structures captured by motifs, subgraphs consisting of a small number of nodes in complex networks. In this paper, we propose a novel framework, motif-based PageRank (MPR), to incorporate higher-order s...
متن کامل